Decidable and Undecidable Problems in Matrix Theory
نویسنده
چکیده
This work is a survey on decidable and undecidable problems in matrix theory. The problems studied are simply formulated, however most of them are undecidable. The method to prove undecidabilities is the one found by Paterson [Pat] in 1970 to prove that the mortality of nitely generated matrix monoids is undecidable. This method is based on the undecidability of the Post Correspondence Problem. We shall present a new proof to this mortality problem, which still uses the method of Paterson, but is a bit simpler.
منابع مشابه
Decidable and Undecidable Problems about Quantum Automata
We study the following decision problem: is the language recognized by a quantum finite automaton empty or nonempty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or nonstrict thresholds. This result is in contrast with the corresponding situation for probabilistic finite automata, for which it is known that strict and nonstrict thr...
متن کاملReal Hilbertianity and the Field of Totally Real Numbers
We use moduli spaces for covers of the Riemann sphere to solve regular embedding problems, with prescribed extendability of orderings, over PRC fields. As a corollary we show that the elementary theory of Qtr is decidable. Since the ring of integers of Qtr is undecidable, this gives a natural undecidable ring whose quotient field is decidable.
متن کاملComposition problems for braids: Membership, Identity and Freeness
In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, B3, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-complete for braids with only three strands. The membership problem is decidable in NP for B3, but it...
متن کاملSome decision problems
Given a finite set of matrices with integer entries, consider the question of determining whether the semigroup they generated 1) is free, 2) contains the identity matrix, 3) contains the null matrix or 4) is a group. Even for matrices of dimension 3, questions 1) and 3) are undecidable. For dimension 2, they are still open as far as we know. Here we prove that problems 2) and 4) are decidable ...
متن کاملA Note on the Emptiness of Intersection Problem for Left Szilard Languages
As left Szilard languages form a subclass of simple deterministic languages and even a subclass of super-deterministic languages, we know that their equivalence problem is decidable. In this note we show that their emptiness of intersection problem is undecidable. The proof follows the lines of the correponding proof for simple deterministic languages, but some technical tricks are needed. This...
متن کامل